Approximation of ECG Signals using Chebyshev Polynomials
نویسندگان
چکیده
The ECG (Electrocardiogram) signal represents electrical activity of heart and is recorded for monitoring and diagnostic purpose. These signals are corrupted by artifacts during acquisition and transmission predominantly by high frequency noise due to power line interference, electrode movements, etc. Addition of these noise change the amplitude and shape of the ECG signal which affect accurate analysis and hence need to be removed for better clinical evaluation. In this paper, ECG signal taken from MIT -BIH database is first denoised using Total Variation Denoising (TVD); using Majorization minimization (MM) optimization technique. ECG signals generate massive volume of digital data, so they need to be suitably compressed for efficient transmission and storage. Hence, for efficient compression the signal is segmented into various sections using Bottom-Up approach. The individual sections are then approximated using Chebyshev polynomials of suitable orders. The performance of the approximation technique is measured by computing the Maximum Absolute Error, the Compression Ratio, Root Mean Square Error, Percent Root Mean Square Difference and Percent Root Mean Square Difference Normalized. The results are also compared with other techniques as reported in the literature, where significant improvements in all the performance metrics are observed.
منابع مشابه
Modeling and Segmentation of Ecg Signals through Chebyshev Polynomials
ECG (Electrocardiogram) signals originating from heart muscles, generate massive volume of digital data. They need to be compressed or approximated for efficient transmission and storage. ECG signal compression is traditionally performed in three ways: direct, transform and parameter extraction. Polynomial approximation which is a form of parameter extraction method, is employed here. This pape...
متن کاملSolving Differential Equations by Using a Combination of the First Kind Chebyshev Polynomials and Adomian Decomposition Method
In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method
متن کاملA fractional type of the Chebyshev polynomials for approximation of solution of linear fractional differential equations
In this paper we introduce a type of fractional-order polynomials based on the classical Chebyshev polynomials of the second kind (FCSs). Also we construct the operational matrix of fractional derivative of order $ gamma $ in the Caputo for FCSs and show that this matrix with the Tau method are utilized to reduce the solution of some fractional-order differential equations.
متن کاملNumerical solution of general nonlinear Fredholm-Volterra integral equations using Chebyshev approximation
A numerical method for solving nonlinear Fredholm-Volterra integral equations of general type is presented. This method is based on replacement of unknown function by truncated series of well known Chebyshev expansion of functions. The quadrature formulas which we use to calculate integral terms have been imated by Fast Fourier Transform (FFT). This is a grate advantage of this method which has...
متن کاملGeneralized Chebyshev polynomials of the second kind
We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the approximation of continuous functions by Chebyshev interpolation and Chebyshev series and how to efficiently compute such approximations. We conclude the pap...
متن کامل